Direct Sum Related Problems in Communication Complexity
نویسندگان
چکیده
1 Abbreviations and Notations 2
منابع مشابه
Direct Sum Questions in Classical Communication Complexity
In 1988, Karchmer and Wigderson generalized Yao’s two-party communication model of functions to relations and showed a remarkable connection of this model to the Boolean circuit model. A few years later, continuing this line of work, Karchmer, Raz, and Wigderson proposed a program to separate NC from P through direct-sum-type inequalities in communication complexity. This spurred the study of t...
متن کاملA New, Fully Quantum Notion of Information Complexity, and an Application to Direct Sum for Bounded Round Quantum Communication Complexity
Direct Sum for Bounded Round Quantum Communication Complexity Dave Touchette 1 We present the first general direct sum theorem for quantum communication complexity that holds for more than a single round of communication. A direct sum theorem states that to compute n tasks simultaneously requires as much resources as the amount of the given resource required for computing them separately. By a ...
متن کاملThe Direct Sum of Universal Relations
The universal relation is the communication problem in which Alice and Bob get as inputs two distinct strings, and they are required to find a coordinate on which the strings differ. The study of this problem is motivated by its connection to Karchmer-Wigderson relations [KW90], which are communication problems that are tightly related to circuit-depth lower bounds. In this paper, we prove a di...
متن کاملInformational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
Given copies of the same problem, does it take times the amount of resources to solve these problems? This is the direct sum problem, a fundamental question that has been studied in many computational models. We study this question in the simultaneous message (SM) model of communication introduced by Yao [Y79]. The equality problem for -bit strings is well known to have SM complexity . We prove...
متن کاملLimitations of Non-uniform Computational Models
The demonstration of a limitation on the abilities of a computational model is a central theme in complexity theory. Hardness results, which demonstrate such limitations, are crucial for complexity theory’s efforts to classify problems into classes based on their inherent difficulty. In this work, we discuss three well-studied models of computation and prove hardness results in each of them. Th...
متن کامل